Regularized symmetric positive definite matrix factorizations for linear systems arising from RBF interpolation and differentiation
نویسندگان
چکیده
منابع مشابه
Parallel Numerical Algorithms for Symmetric Positive Definite Linear Systems
We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...
متن کاملBlock Preconditioners for Linear Systems Arising from Multilevel RBF Collocation∗
Symmetric multiscale collocation methods with radial basis functions allow approximation of the solution of a partial differential equation, even if the right-hand side is only known at scattered data points, without needing to generate a grid. However, the benefit of a guaranteed symmetric positive definite block system comes at a high computational cost. In particular, the condition number an...
متن کاملIterative Regularized Solution of Symmetric and Positive Semi-Definite Linear Complementarity Problems
In this report an iterative method from the theory of maximal monotone operators is transfered into the context of linear complementarity problems and numerical tests are performed on contact problems from the field of rigid multibody dynamics.
متن کاملScaling-Rotation Distance and Interpolation of Symmetric Positive-Definite Matrices
We introduce a new geometric framework for the set of symmetric positive-definite (SPD) matrices, aimed at characterizing deformations of SPD matrices by individual scaling of eigenvalues and rotation of eigenvectors of the SPD matrices. To characterize the deformation, the eigenvalue-eigenvector decomposition is used to find alternative representations of SPD matrices and to form a Riemannian ...
متن کاملPositive Definite and Semi-definite Splitting Methods for Non-hermitian Positive Definite Linear Systems
In this paper, we further generalize the technique for constructing the normal (or positive definite) and skew-Hermitian splitting iteration method for solving large sparse nonHermitian positive definite system of linear equations. By introducing a new splitting, we establish a class of efficient iteration methods, called positive definite and semi-definite splitting (PPS) methods, and prove th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Engineering Analysis with Boundary Elements
سال: 2014
ISSN: 0955-7997
DOI: 10.1016/j.enganabound.2014.04.019